On the Length of Snakes in Powers of Complete Graphs

The conjecture stated in an earlier paper by the author thatthere is a constant (independent from both n and k) such that n^d–1 holds for everyn 2 and d 2, where is the length of the longest snake (cycle without chords) in the Cartesianproduct of d copies of thecomplete graph K_n, is proved.     

Construction of multivariate biorthogonal wavelets with arbitrary vanishing moments

We present a concrete method to build discrete biorthogonal systems such that the wavelet filters have any number of vanishing moments. Several algorithms are proposed to construct multivariate biorthogonal wavelets with any general dilation matrix and arbitrary order of vanishing moments. Examples are provided to illustrate the general theory and the advantages of the algorithms. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the existence of intermediate magnetohydrodynamic shock waves

We consider the questions related to the structure of shock waves for a system of magnetohydrodynamic equations. Using Conley's connection matrix, we recover and extend earlier results due to C. Conley and J. Smoller. In particular, we give a simpler proof of the existence of fast and slow shocks with structure. We also demonstrate that for some viscosity parameters intermediate shocks occur. Furthermore, under an assumption of transversality, we show that there exist multi-parameter families of these intermediate shocks.This research was done while both authors were visiting the Lefschetz Center for Dynamical Systems at Brown University.Supported in part by the NSF under Grant DMS-8507056.Supported in part by AFOSR 87-0347.     

Asymptotic energy of lattices

The energy of a simple graph G arising in chemical physics, denoted by E(G), is defined as the sum of the absolute values of eigenvalues of G. As the dimer problem and spanning trees problem in statistical physics, in this paper we propose the energy per vertex problem for lattice systems. In general for a type of lattice in statistical physics, to compute the entropy constant with toroidal, cylindrical, Mobius-band, Klein-bottle, and free boundary conditions are different tasks with different hardness and may have different solutions. We show that the energy per vertex of plane lattices is independent of the toroidal, cylindrical, Mobius-band, Klein-bottle, and free boundary conditions. In particular, the asymptotic formulae of energies of the triangular, 3³.4², and hexagonal lattices with toroidal, cylindrical, Mobius-band, Klein-bottle, and free boundary conditions are obtained explicitly.     

Some applications of the AMPC model of the shear yield stress of particulate fluids

The AMPC structural model of shear yield stress of single component suspensions is extended to three important rheological phenomena encountered in particulate fluids. These are shear yield stress of multi-component systems, time dependent shear yield stress of thixotropic suspensions, and compressive yield stress of particulate fluids. The shear yield stress of multi-component suspensions is modeled by summing the interparticle interactions due to all possible combinations of particle sizes and solid constituents. The time dependent shear yield stress of thixotropic muds is simulated by invoking the proportionality between yield stress and interparticle bond density across the shear plane. The compressive yield stress of particulate fluids is calculated by assuming that consolidation occurs by shear but at a narrower gap between the particles. The ability of the model to describe these diverse phenomena reasonably well seemingly validates its basic premise, namely, a 3-dimensional space-filling network of particles whose mechanical properties can be estimated from the theory of strength of particulate assemblage.     

有向跳图的生成欧拉子有向图

一个有向多重图D的跳图$J(D)$是一个顶点集为$D$的弧集,其中$(a,b)$是$J(D)$的一条弧当且仅当存在有向多重图$D$中的顶点$u_1$, $v_1$, $u_2$, $v_2$,使得$a=(u_1,v_1)$, $b=(u_2,v_2)$ 并且$v_1\neq u_2$.本文刻画了有向多重图类$\mathcal{H}_1$和$\mathcal{H}_2$,并证明了一个有向多重图$D$的跳图$J(D)$是强连通的当且仅当$D\not\in \mathcal{H}_1$.特别地, $J(D)$是弱连通的当且仅当$D\not\in \mathcal{H}_2$.进一步, 得到以下结果: (i) 存在有向多重图类$\mathcal{D}$使得有向多重图$D$的强连通跳图$J(D)$是强迹连通的当且仅当$D\not\in\mathcal{D}$. (ii) 每一个有向多重图$D$的强连通跳图$J(D)$是弱迹连通的,因此是超欧拉的. (iii) 每一个有向多重图D的弱连通跳图$J(D)$含有生成迹.     

Supereulerian regular matroids without small cocircuits

A cycle of a matroid is a disjoint union of circuits. A matroid is supereulerian if it contains a spanning cycle. To answer an open problem of Bauer in 1985, Catlin proved in [J. Graph Theory 12 (1988) 29–44] that for sufficiently large $n$, every 2-edge-connected simple graph $G$ with $\text{◂=▸}n=\mid V\left(G\right)\mid$ and minimum degree $\text{◂≥▸}\delta \left(G\right)\ge \frac{n}{5}$ is supereulerian. In [Eur. J. Combinatorics, 33 (2012), 1765–1776], it is shown that for any connected simple regular matroid $M$, if every cocircuit $D$ of $M$ satisfies $\text{◂≥▸}\mid D\mid \ge \max \left\{\frac{\text{◂−▸}r\left(M\right)-5}{5},6\right\}$, then $M$ is supereulerian. We prove the following. (i) Let $M$ be a connected simple regular matroid. If every cocircuit $D$ of $M$ satisfies $\text{◂≥▸}\mid D\mid \ge \max \left\{\frac{\text{◂+▸}r\left(M\right)+1}{10},9\right\}$, then $M$ is supereulerian. (ii) For any real number $c$ with , there exists an integer $f\left(c\right)$ such that if every cocircuit $D$ of a connected simple cographic matroid $M$ satisfies $\mid D\mid \ge \text{◂lim▸}\max \text{◂{}▸}\{c\text{◂()▸}\left(r\left(M\right)+1\right),f\left(c\right)\}$, then $M$ is supereulerian.